Effects of Contrarians in the Minority Game

We study the effects of the presence of contrarians in an agent-based model of competing populations. Contrarians are common in societies. These contrarians are agents who deliberately prefer to hold an opinion that is contrary to the prevailing idea of the commons or normal agents. Contrarians are introduced within the context of the Minority Game (MG), which is a binary model for an evolving and adaptive population of agents competing for a limited resource. Results of numerical simulations reveal that the average success rate among the agents depends non-monotonically on the fraction $a_{c}$ of contrarians. For small $a_{c}$, the contrarians systematically outperform the normal agents by avoiding the crowd effect and enhance the overall success rate. For high $a_{c}$, the anti-persistent nature of the MG is disturbed and the few normal agents outperform the contrarians. Qualitative discussion and analytic results for the small $a_{c}$ and high $a_{c}$ regimes are also presented, and the crossover behavior between the two regimes is discussed.Comment: revtex, 11 pages, 4 figure

Dynamics of opinion formation in a small-world network

The dynamical process of opinion formation within a model using a local majority opinion updating rule is studied numerically in networks with the small-world geometrical property. The network is one in which shortcuts are added to randomly chosen pairs of nodes in an underlying regular lattice. The presence of a small number of shortcuts is found to shorten the time to reach a consensus significantly. The effects of having shortcuts in a lattice of fixed spatial dimension are shown to be analogous to that of increasing the spatial dimension in regular lattices. The shortening of the consensus time is shown to be related to the shortening of the mean shortest path as shortcuts are added. Results can also be translated into that of the dynamics of a spin system in a small-world network.Comment: 10 pages, 5 figure

Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable

There has been significant recent interest in parallel graph processing due to the need to quickly analyze the large graphs available today. Many graph codes have been designed for distributed memory or external memory. However, today even the largest publicly-available real-world graph (the Hyperlink Web graph with over 3.5 billion vertices and 128 billion edges) can fit in the memory of a single commodity multicore server. Nevertheless, most experimental work in the literature report results on much smaller graphs, and the ones for the Hyperlink graph use distributed or external memory. Therefore, it is natural to ask whether we can efficiently solve a broad class of graph problems on this graph in memory. This paper shows that theoretically-efficient parallel graph algorithms can scale to the largest publicly-available graphs using a single machine with a terabyte of RAM, processing them in minutes. We give implementations of theoretically-efficient parallel algorithms for 20 important graph problems. We also present the optimizations and techniques that we used in our implementations, which were crucial in enabling us to process these large graphs quickly. We show that the running times of our implementations outperform existing state-of-the-art implementations on the largest real-world graphs. For many of the problems that we consider, this is the first time they have been solved on graphs at this scale. We have made the implementations developed in this work publicly-available as the Graph-Based Benchmark Suite (GBBS).Comment: This is the full version of the paper appearing in the ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 201

Properties of 12^{12}C in the {\it ab initio} nuclear shell-model

We obtain properties of $^{12}$C in the {\it ab initio} no-core nuclear shell-model. The effective Hamiltonians are derived microscopically from the realistic CD-Bonn and the Argonne V8' nucleon-nucleon (NN) potentials as a function of the finite harmonic oscillator basis space. Binding energies, excitation spectra and electromagnetic properties are presented for model spaces up to $5\hbar\Omega$. The favorable comparison with available data is a consequence of the underlying NN interaction rather than a phenomenological fit.Comment: 9 pages, 2 figure

Global persistence exponent of the two-dimensional Blume-Capel model

The global persistence exponent $\theta_g$ is calculated for the two-dimensional Blume-Capel model following a quench to the critical point from both disordered states and such with small initial magnetizations. Estimates are obtained for the nonequilibrium critical dynamics on the critical line and at the tricritical point. Ising-like universality is observed along the critical line and a different value $\theta_g =1.080(4)$ is found at the tricritical point.Comment: 7 pages with 3 figure

The clustering of massive galaxies at z~0.5 from the first semester of BOSS data

We calculate the real- and redshift-space clustering of massive galaxies at z~0.5 using the first semester of data by the Baryon Oscillation Spectroscopic Survey (BOSS). We study the correlation functions of a sample of 44,000 massive galaxies in the redshift range 0.4<z<0.7. We present a halo-occupation distribution modeling of the clustering results and discuss the implications for the manner in which massive galaxies at z~0.5 occupy dark matter halos. The majority of our galaxies are central galaxies living in halos of mass 10^{13}Msun/h, but 10% are satellites living in halos 10 times more massive. These results are broadly in agreement with earlier investigations of massive galaxies at z~0.5. The inferred large-scale bias (b~2) and relatively high number density (nbar=3e-4 h^3 Mpc^{-3}) imply that BOSS galaxies are excellent tracers of large-scale structure, suggesting BOSS will enable a wide range of investigations on the distance scale, the growth of large-scale structure, massive galaxy evolution and other topics.Comment: 11 pages, 12 figures, matches version accepted by Ap

Universality and scaling study of the critical behavior of the two-dimensional Blume-Capel model in short-time dynamics

In this paper we study the short-time behavior of the Blume-Capel model at the tricritical point as well as along the second order critical line. Dynamic and static exponents are estimated by exploring scaling relations for the magnetization and its moments at early stage of the dynamic evolution. Our estimates for the dynamic exponents, at the tricritical point, are $z= 2.215(2)$ and $\theta= -0.53(2)$.Comment: 12 pages, 9 figure

Evaluating the use of the Child and Adolescent Intellectual Disability Screening Questionnaire (CAIDS-Q) to estimate IQ in children with low intellectual ability

In situations where completing a full intellectual assessment is not possible or desirable the clinician or researcher may require an alternative means of accurately estimating intellectual functioning. There has been limited research in the use of proxy IQ measures in children with an intellectual disability or low IQ. The present study aimed to provide a means of converting total scores from a screening tool (the Child and Adolescent Intellectual Disability Screening Questionnaire: CAIDS-Q) to an estimated IQ. A series of linear regression analyses were conducted on data from 428 children and young people referred to clinical services, where FSIQ was predicted from CAIDS-Q total scores. Analyses were conducted for three age groups between ages 6 and 18 years. The study presents a conversion table for converting CAIDS-Q total scores to estimates of FSIQ, with corresponding 95% prediction intervals to allow the clinician or researcher to estimate FSIQ scores from CAIDS-Q total scores. It is emphasised that, while this conversion may offer a quick means of estimating intellectual functioning in children with a below average IQ, it should be used with caution, especially in children aged between 6 and 8 years old

Evolution in the Cluster Early-type Galaxy Size-Surface Brightness Relation at z =~ 1

We investigate the evolution in the distribution of surface brightness, as a function of size, for elliptical and S0 galaxies in the two clusters RDCS J1252.9-2927, z=1.237 and RX J0152.7-1357, z=0.837. We use multi-color imaging with the Advanced Camera for Surveys on the Hubble Space Telescope to determine these sizes and surface brightnesses. Using three different estimates of the surface brightnesses, we find that we reliably estimate the surface brightness for the galaxies in our sample with a scatter of < 0.2 mag and with systematic shifts of \lesssim 0.05 mag. We construct samples of galaxies with early-type morphologies in both clusters. For each cluster, we use a magnitude limit in a band which closely corresponds to the rest-frame B, to magnitude limit of M_B = -18.8 at z=0, and select only those galaxies within the color-magnitude sequence of the cluster or by using our spectroscopic redshifts. We measure evolution in the rest-frame B surface brightness, and find -1.41 \+/- 0.14 mag from the Coma cluster of galaxies for RDCS J1252.9-2927 and -0.90 \+/- 0.12 mag of evolution for RX J0152.7-1357, or an average evolution of (-1.13 \+/- 0.15) z mag. Our statistical errors are dominated by the observed scatter in the size-surface brightness relation, sigma = 0.42 \+/- 0.05 mag for RX J0152.7-1357 and sigma = 0.76 \+/- 0.10 mag for RDCS J1252.9-2927. We find no statistically significant evolution in this scatter, though an increase in the scatter could be expected. Overall, the pace of luminosity evolution we measure agrees with that of the Fundamental Plane of early-type galaxies, implying that the majority of massive early-type galaxies observed at z =~ 1 formed at high redshifts.Comment: Accepted in ApJ, 16 pages in emulateapj format with 15 eps figures, 6 in colo